Mega Code Archive
Collections
1) A basic priority linked list
2) A binary search implementation
3) A boolean is being stored and then retrieved from an ArrayList
4) A class that wraps an array with a List interface
5) A combination of two collections into a collection
6) A doubly-linked list
7) A faster, smaller stack implementation
8) A fixed size map implementation
9) A hash map that uses primitive ints for the key rather than objects
10) A java util Map implementation using reference values
11) A Least Recently Used Cache
12) A map declared to hold objects of a type T can also hold objects that extend from T
13) A Map where keys are compared by object identity, rather than equals()
14) A memory-efficient hash map
15) A Priority Queue
16) A Properties file stored in a JAR can be loaded this way
17) A Queue Implemented by a Linked List
18) A simple Doubly Linked list class, designed to avoid O(n) behaviour on insert and delete
19) A simple hashmap from keys to integers
20) A simple integer based stack
21) A simple linked List implementation
22) A sorted set is a set that maintains its items in a sorted order
23) A stack allows access to only one data item
24) A stack of simple integers
25) A thin wrapper around a List transforming it into a modifiable Set
26) A value retrieved from a type-specific collection does not need to be casted
27) A variable length Double Array
28) A very simple unsynchronized stack This one is faster than the java util-Version
29) A weak HashSet
30) A writer for char strings
31) AbstractSet Class
32) Add an element to specified index of ArrayList
33) Add elements at beginning and end of LinkedList
34) Add object to LinkedList
35) Add or insert an element to ArrayList using Java ListIterator
36) Adding Another Collection
37) Adding Another Collection with the addAll() method
38) Adding Elements
39) Adding elements in the middle of a List
40) Adding in the Middle
41) Adding Key-Value Pairs
42) Adding Single Elements
43) Adds all the elements of the given arrays into a new double-type array
44) After adding all of the elements, call the trimToSize() method
45) Alternative Array Declaration Syntax
46) An array is a Java object
47) An easy way to initialize a set without manually adding each element
48) An enumeration that iterates over an array
49) An IdentityMap that uses reference-equality instead of object-equality
50) An IdentitySet that uses reference-equality instead of object-equality
51) An Iterator that returns the elements of a specified array, or other iterators etc
52) An Iterator that wraps a number of Iterators
53) An Iterator wrapper for an Enumeration
54) An Iterator wrapper for an Object[], allow us to deal with all array like structures in a consistent manner
55) An implementation of Set that manages a map of soft references to the set values
56) An implementation of the java util Stack based on an ArrayList instead of a Vector, so it is not synchronized to protect again
57) An iterator that breaks text into lines The result is equal to BufferedReader readLine()
58) An utility class to ease up using property-file resource bundles
59) Anonymous arrays are declared similarly to regular arrays
60) Append all elements of other Collection to ArrayList
61) Append all elements of other Collection to Vector
62) Append the given Object to the given array
63) Array clone
64) Array Getter and Setter Methods
65) Array Iterator
66) Array Of int Arrays
67) Array Of string Arrays
68) Array Reallocation
69) Array To String
70) ArrayList Class
71) Array-List for integer objects
72) ArrayList implements the empty Serializable interface
73) Arrays of Arrays
74) Arrays of Arrays in Varying Length
75) Arrays of Characters
76) Arrays of Objects
77) Arrays of Strings
78) Associating a Value with an Object
79) Automatically Removing an Unreferenced Element from a Hash Table
80) Binary Heap Queue
81) Binary search
82) Binary search routines
83) Binary Searching
84) Bit Set Operations
85) BlockingDeque
86) Bubble Sort
87) ByteArray wraps java byte arrays (byte[]) to allow byte arrays to be used as keys in hashtables
88) Cache based on SoftReference
89) Cache Map
90) Calendar Comparator
91) CaseBlindHashMap - a HashMap extension, using Strings as key values
92) Changing Array Size
93) Character Stack
94) Check if a particular element exists in HashSet
95) Check if a particular element exists in Java LinkedHashSet
96) Check if a particular element exists in LinkedList
97) Check if a particular key exists in HashMap
98) Check if a particular key exists in Java Hashtable
99) Check if a particular key exists in Java LinkedHashMap example
100) Check if a particular key exists in TreeMap
101) Check if a particular value exists in HashMap
102) Check if a particular value exists in Java Hashtable
103) Check if a particular value exists in Java LinkedHashMap example
104) Check if a particular value exists in TreeMap
105) Check if a particular value exists in TreeSet
106) Check if the given object is an array (primitve or native)
107) Check whether the given Collection contains the given element instance
108) Checking Capacity
109) Checking Equality
110) Checking for Collection Containment
111) Checking for Equality
112) Checking for Existence
113) Checking for List Containment
114) Checking for no elements in the set
115) Checking for Position
116) Checking for Position from End
117) Checking Hash Maps for Equality
118) Checking Size
119) Checking the Top
120) Checking Vectors for Equality
121) Checking what item is first in line without removing it
122) Checks whether two arrays are the same length, treating null arrays as length 0
123) Checks whether two arrays are the same type taking into account multi-dimensional arrays
124) Circular Buffer
125) Circular Queue
126) Classes Implementing Comparable
127) Clones a map and prefixes the keys in the clone
128) Cloning Bit Sets
129) Cloning Hash Map
130) Cloning Hash Tables
131) Collections reverseOrder()
132) Comparable with a sorted collection
133) Comparator uses a Collator to determine the proper, case-insensitive lexicographical ordering of two strings
134) Compare two byte type arrays
135) Compare two char type arrays
136) Compare two double type arrays
137) Compare two float type arrays
138) Compare two int type arrays
139) Compare two long type arrays
140) Compare two short type arrays
141) Concatenates the content of two enumerations into one
142) Concatenates two arrays of strings
143) Concurrent Modification Exception
144) Concurrent set
145) Contains() and containsValue()
146) Conversion of different Collection data types
147) Convert a LinkedList to ArrayList
148) Convert a List (ArrayList) to an Array with full length array
149) Convert a List (ArrayList) to an Array with zero length array
150) Convert a List to a Set
151) Convert a Properties list into a map
152) Convert a Queue to a List
153) Convert an Array to a List
154) Convert an ArrayList to HashSet
155) Convert array to Set
156) Convert Collection to ArrayList
157) Convert LinkedList to Array with full length array
158) Convert LinkedList to Array with zero length array
159) Convert Properties into Map
160) Convert Set into array
161) Convert Set into List
162) Convert the given array (which may be a primitive array) to an object array
163) Converting elements in a set to Array
164) Converting the vector to an array
165) Converts array into a java util Map
166) Copies the given array and adds the given element at the end of the new array (long value type)
167) Copy a set of properties from one Property to another
168) Copy all elements in TreeSet to an Object Array
169) Copy all elements of ArrayList to an Object Array
170) Copy all elements of HashSet to an Object Array
171) Copy all elements of Java LinkedHashSet to an Object Array
172) Copy all the elements from set2 to set1 (set1 += set2), set1 becomes the union of set1 and set2
173) Copy Elements of ArrayList to Java Vector
174) Copy Elements of One ArrayList to Another ArrayList
175) Copy Elements of One Vector to Another Vector with Collection copy
176) Copy Elements of Vector to ArrayList with Collection copy
177) Copy some items of an array into another array
178) Copying all the key-value pairs from one Hashtable (or any Map) into another Hashtable
179) Copying and Cloning Arrays
180) Copying and Cloning Lists
181) Copying and Cloning Sets
182) Copying and Cloning Vectors
183) Copying elements out of a list into an array
184) Count distinct elements in a Vector
185) Counting Word Occurrences with a hash table
186) Create a queue using LinkedList class
187) Create a Stack and Queue using ArrayDeque
188) Create a WeakHashMap with a single element in it
189) Create an array containing the elements in a set
190) Create an array containing the keys in a map
191) Create an array containing the values in a map
192) Create an empty collection object
193) Create an object array from elements of LinkedList
194) Create and demonstrate an immutable collection
195) Create Java ArrayList From Enumeration which is from Vector
196) Create Java Hashtable from HashMap
197) Create NavigableMap from TreeMap
198) Create new sets from Iterable, var argv
199) Create Properties from String array
200) Create singleton Iterator
201) Create TreeSet from String array
202) Create type specific collections
203) Create unique lists of items
204) Creates a mutable map from two arrays with keys and values
205) Creating a Comparable object
206) Creating a Copy of a Collection
207) Creating a Hash Table
208) Creating a HashSet
209) Creating a Map That Retains Order-of-Insertion
210) Creating a Set That Retains Order-of-Insertion
211) Creating a Sorted Set
212) Creating a TreeSet
213) Creating a Type-Specific Map
214) Creating a Type-Specific Map [5 0]
215) Creating an ArrayList
216) Creating and storing arrays in a map
217) Creating Custom Enumerations
218) Creating Hash Tables
219) Creating Iterable Objects
220) Cyclic Iteration
221) Deep clone collection
222) Defining Multidimensional Arrays
223) Demonstrate String arrays
224) Demonstrate the generic Stack class
225) Demonstrating a stack implemented as a list
226) Demonstrating linked list
227) Demonstrating the WeakHashMap
228) Determining Set Size
229) Displaying Contents
230) Displaying Hash Table Contents
231) Double-Ended Lists
232) Doubling the size of an array
233) Dump multi-dimensional arrays
234) Duplicate elements are discarded
235) Empty Collections
236) EnsureCapacity()
237) Enumerate through a Vector using Java Enumeration
238) Enumerating through the Elements
239) Extend the size of an array
240) Extends ArrayListT to create Stack
241) FastQSorts the [l,r] partition (inclusive) of the specfied array of Rows, using the comparator
242) Fetching Elements
243) Fetching Elements with iterator
244) Fetching Keys and Values
245) Fill to a contiguous range of elements in an array
246) Filling Arrays method signature
247) Filling byte array
248) Filling Elements in an Array
249) Filling object arrays
250) Filters enumeration to contain each of the provided elements just once
251) Filters some elements out from the input enumeration
252) Find a value of the given type in the given Collection
253) Find maximum element of ArrayList
254) Find maximum element of HashSet
255) Find maximum element of Java Vector
256) Find Minimum element of ArrayList
257) Find Minimum element of HashSet
258) Find Minimum element of Java Vector
259) Finding all the positions for a single element
260) Finding and Deleting Specified Links
261) Finding Elements
262) Finding Extremes
263) Finds the index of the given object in the array
264) Finds the index of the given object in the array starting at the given index
265) Finds the last index of the given object in the array starting at the given index
266) Finds the value in the range (start,limit) of the largest element (rank) where the count of all smaller elements in that range
267) Fixed size hash map using String values as keys mapped to primitive int values
268) For both the keys and values of a map
269) For each element of the input enumeration asks the Processor to provide a replacement
270) For each loop with generic NavigableSet, created from TreeSet
271) For keys of a map
272) For statement for Iterable object in JDK 5 has been enhanced
273) For values of a map
274) Framework Interfaces
275) Generic Comparable
276) Generic Merge Sorter with generic Comparator
277) Get a key from value with an HashMap
278) Get all keys and elements from a hash table
279) Get array length using reflection method
280) Get array upperbound
281) Get ceiling key from NavigableMap
282) Get Collection of Values from Hashtable
283) Get container with Iterator from ArrayList
284) Get elements from LinkedList
285) Get Enumeration over ArrayList
286) Get Enumeration over HashSet
287) Get Enumeration over Java Vector
288) Get first and last elements from LinkedList
289) Get first key and first entry from NavigableMap
290) Get floor key from NavigableMap
291) Get Head Map from TreeMap
292) Get Head Set from Java TreeSet
293) Get higher key from NavigableMap
294) Get last key and last entry from NavigableMap
295) Get lower key from NavigableMap
296) Get lowest and highest key stored in TreeMap
297) Get lowest and highest value stored in TreeSet
298) Get navigable key set from NavigableMap
299) Get Previous and next index using Java ListIterator
300) Get Set view of Keys from HashMap
301) Get Set view of Keys from Hashtable
302) Get Set view of Keys from Java LinkedHashMap
303) Get Set view of Keys from TreeMap
304) Get Size of HashMap
305) Get Size of HashSet
306) Get Size of Java LinkedHashMap
307) Get Size of Java LinkedHashSet
308) Get Size of TreeSet
309) Get Sub List of ArrayList
310) Get Sub Map from TreeMap
311) Get Sub Set from TreeSet
312) Get SubList from LinkedList
313) Get Synchronized List from ArrayList
314) Get Synchronized Map from HashMap
315) Get Synchronized Map from TreeMap
316) Get Synchronized Set from HashSet
317) Get Synchronized Set from TreeSet
318) Get Tail Map from TreeMap
319) Get Tail Set from TreeSet
320) Get the difference of two collections
321) Get the element index or last index among a boolean type array
322) Get the index and last index of an int type value array
323) Get the intersection of set1 and set2, set1 becomes the intersection of set1 and set2
324) Get TreeMap Size
325) Gets strong-type-value property from a standard Properties
326) Gets the child of the specified element having the specified unique name
327) Gets the subarray from array that starts at offset
328) Gets the subarray of length length from array that starts at offset
329) Getting a key List from Properties
330) Getting an Element
331) Getting and Setting Properties
332) Getting by Position
333) Getting elements (key-value pairs) from a Hashtable
334) Getting elements by Index with Generics
335) Getting elements by Index without generics
336) Getting property by String key value
337) Getting reverse order comparator
338) Getting the set of all keys with the keySet() method
339) Growable int stack with type specific access methods
340) Growable Object stack with type specific access methods
341) Growable String array with type specific access methods
342) Growable String stack with type specific access methods
343) Hash map for counting references to Object keys
344) Hash map using String values as keys mapped to primitive int values
345) HashMap Class
346) HashNMap stores multiple values by a single key value Values can be retrieved using a direct query or by creating an enumerati
347) HashSet implements the empty Serializable interface
348) Hashtable Immutability
349) Have a multi-line value in a properties file
350) Headset, tailset and subset
351) Helper method for creating list
352) How do I Store simple pairs of data for quick lookup
353) copy an array
354) define an Array
355) sort an array
356) If an ArrayList contains a given item
357) If key is not in add the key value pair
358) If the given objects are equal
359) If the size of the stack is zero, true is returned; otherwise, false is returned
360) If you prefer a for-loop
361) Implementation of a bit map of any size, together with static methods to manipulate int, byte and byte[] values as bit maps.tx
362) Implementing a Comparator for a class
363) Implementing a Queue with LinkedList
364) Implementing a Stack
365) Implements a combination of WeakHashMap and IdentityHashMap
366) Implements an java util Iterator over any array
367) Implements the Set interface, backed by a ConcurrentHashMap instance
368) Initialize a two-dimensional array in matrix
369) Initializing array elements by index
370) Initializing Arrays
371) Insert all elements of other Collection to Specified Index of ArrayList
372) Insertion Sort
373) Integer value set
374) Interface type and its implementation
375) IntMap provides a simple hashmap from keys to integers
376) Invertible Comparator
377) Iterable interface
378) Iterate a Collection and remove an item (Exception, wrong version)
379) Iterate through a Collection using Java Iterator
380) Iterate through elements ArrayList using ListIterator
381) Iterate through elements of HashSet
382) Iterate through elements of Java LinkedHashSet
383) Iterate through elements of Java LinkedList using Iterator
384) Iterate through elements of Java LinkedList using ListIterator
385) Iterate through elements of TreeSet
386) Iterate through keys of Java Hashtable
387) Iterate through the values of HashMap
388) Iterate through the values of Java LinkedHashMap
389) Iterate through the values of TreeMap
390) Iterate through values of Java Hashtable
391) Iterator class for sparse values in an array
392) Iterator class for values contained in an array range
393) Iterator from LinkedList
394) Iterator Union of Iterators
395) Iterator Utils
396) Iterators on a linked list
397) Java Sort byte Array
398) Java Sort char Array
399) Java Sort double Array
400) Java Sort float Array
401) Java utils Arrays provides ways to dump the content of an array
402) Java vectors
403) Keeping upper and lowercase letters together
404) Lazy List creation
405) Linked List Entry
406) LinkedList
407) LinkedList Class
408) List containing other lists
409) List implementation with lazy array construction and modification tracking
410) List ordered map
411) List Properties to a print stream or print writer
412) List Set
413) ListIterator
414) Listing the Elements of a Collection(iterate over the elements of set or list)
415) Load a properties file in the classpath
416) Load a properties file in the startup directory
417) Loading and Saving properties
418) Lookup table that stores a list of strings
419) Looping through a Collection object
420) Looping through a sorted set backwards
421) Making a Collection Read-Only
422) Making a queue from a LinkedList
423) Making a stack from a LinkedList
424) Making Your Objects Comparable and Sortable
425) Manipulating Sets of Bits
426) Map Entry Interface
427) Map implementation Optimized for Strings keys
428) Map techniques
429) Map with keys iterated in insertion order
430) Merge (or add) two arrays into one
431) Merge Properties Into Map
432) Mergesort
433) Minimum and maximum number in array
434) Modifying the list that the iterator came from
435) Multidimensional Vectors (Vectors of Vectors)
436) NavigableMap Demo
437) NavigableSet by TreeSet
438) NavigableSet ceiling
439) NavigableSet floor
440) NavigableSet higher
441) NavigableSet lower
442) Object Arrays
443) One Item Set
444) Ordered Map
445) Passing the object to remove to either of the remove() or removeElement() methods
446) Perform Binary Search on ArrayList
447) Perform Binary Search on Java Vector
448) Performing Binary Search on Java Array
449) Printing Vectors
450) Priority Queues
451) Producer and consumer based on BlockingQueue
452) Produces a new array containing the elements between the start and end indices
453) Property access utility methods
454) Property Loader
455) Protects an given iterator by preventing calls to remove()
456) Public Object[] toArray(Object[] a)
457) Put value to a Property list
458) Puts the entire source array in the target array at offset offset
459) Putting your own type in a LinkedHashSet
460) Queue
461) Quick sort
462) Quick sort with median-of-three partitioning
463) Quicksort
464) Read a set of properties from the received input stream, strip off any excess white space that exists in those property values
465) Read system property as an integer
466) Read-Only Collections
467) Recursive Binary Search Implementation in Java
468) Removal of all elements from a map
469) Remove all elements from a set
470) Remove all elements from HashSet
471) Remove all elements from Java LinkedHashSet
472) Remove all elements from TreeSet
473) Remove all elements or clear LinkedList
474) Remove all the elements in set1 from set2 (set1 -= set2), set1 becomes the asymmetric difference of set1 and set2
475) Remove all values from Java Hashtable
476) Remove all values from Java LinkedHashMap
477) Remove all values from TreeMap
478) Remove an element from ArrayList using Java ListIterator
479) Remove an element from Collection using Java Iterator
480) Remove duplicate items from an ArrayList
481) Remove first and last elements of LinkedList
482) Remove range of elements from LinkedList
483) Remove specified element from HashSet
484) Remove specified element from Java LinkedHashSet
485) Remove specified element from LinkedList
486) Remove specified element from TreeSet
487) Remove value from HashMap
488) Remove value from Java Hashtable
489) Remove value from Java LinkedHashMap
490) Remove value from TreeMap
491) Removes all nulls from the input enumeration
492) Removes the element at the specified position from the specified array
493) Removes the first occurrence of the specified element from the specified array
494) Removing a Single Element
495) Removing All Elements
496) Removing Another Collection
497) Removing Another Collection(Removing elements)
498) Removing Elements
499) Removing Key-Value Pairs
500) Removing Ranges
501) Removing Single Elements
502) Replace All Elements Of ArrayList
503) Replace All Elements Of Vector with Collections fill
504) Replace all occurrences of specified element of ArrayList
505) Replace all occurrences of specified element of Java Vector
506) Replace an element at specified index of Java Vector
507) Replace an element from ArrayList using Java ListIterator
508) Replace an Element of LinkedList
509) Replacing Elements
510) Replacing Elements with the set() method
511) Retaining Another Collection
512) Retrieve environment variables (JDK1 5)
513) Retrieving the Ends for a TreeSet
514) Retrieving the Ends from a LinkedList
515) Return the first element in candidates that is contained in source
516) Returns a Properties object matching the given node
517) Returns an enumeration that iterates over provided array
518) Returns an index into arra (or -1) where the character is not in the charset byte array
519) Returns an int[] array of length segments containing the distribution count of the elements in unsorted int[] array with value
520) Returns an iterator over the children of the given element with the given tag name
521) Returns the minimum value in an array
522) Returns true if all the references in array1 are equal to all the references in array2 (two null references are considered equ
523) Reverse order of all elements of ArrayList
524) Reverse order of all elements of Java Vector
525) Reverses the order of the given long type value array
526) Reverses the order of the given object array
527) Reversing Order
528) Rotate elements of a collection
529) Scan the content of a hashtable
530) Search an element of ArrayList with indexOf and lastIndexOf
531) Search an element of Java Vector
532) Search an element of Vector from specific index
533) Search collection element
534) Search elements of LinkedList
535) Searching Arrays
536) Selection Sort
537) Serializable Enumeration
538) Serializing Hash Maps
539) Serializing Vector
540) Set and HashSet
541) Set implementation that use == instead of equals()
542) Set operations
543) Set that compares object by identity rather than equality
544) Set union and intersection
545) Set value to BitSet and then do AND, OR and XOR actions
546) Set with values iterated in insertion order
547) Setting and Getting Elements
548) Setting vectors size to trim elements
549) Shellsort
550) Shifting Elements in an Array
551) Shuffle elements of an array
552) Shuffle elements of ArrayList
553) Shuffle elements of Vector
554) Simple object pool
555) Simple object pool Based on ThreadPool and few other classes
556) Singleton Collections
557) Sizing Hash Maps
558) Sizing Hash Tables
559) Sizing Vectors
560) Sort an array
561) Sort an array of strings in reverse order
562) Sort an array of strings, ignore case difference
563) Sort an HashMap based on the keys
564) Sort array utilities
565) Sort ArrayList in descending order using comparator
566) Sort based on the values
567) Sort elements of ArrayList
568) Sort items in a Set
569) Sort items of an ArrayList with Collections reverseOrder()
570) Sort keys in an Hashtable
571) Sort on many(more than one) fields
572) Sort Properties when saving
573) Sort Vector in descending order using comparator
574) Sorted Iterator
575) Sorted Lists
576) Sorting a Collection containing user defined Objects
577) Sorting a List
578) Sorting a subset of array elements
579) Sorting an Array in Descending (Reverse) Order
580) Sorting Arrays
581) Sorting arrays of objects
582) Sorting Objects using insertion sort
583) Sorts a property list and turns the sorted list into a string
584) Sorts property list and print out each key=value pair prepended with specific indentation
585) Stack Basics
586) Stack Example
587) Stack for boolean values
588) Storage Capacity
589) Store properties as XML file
590) Stores a list of int
591) Storing Primitive Types in a Collection
592) SubList()
593) Support for breadth-first enumerating
594) Swap elements of ArrayList
595) Swap elements of Vector
596) Synchronized Queue
597) System-Defined Comparable Classes
598) Test the equality of two object arrays
599) The asList() method of the Arrays class will create an object
600) The character array based string
601) The Collections fill() method
602) The Collections Framework consists of three parts
603) The Collections Framework New Types
604) The contains() method
605) The containsAll() method checks if a set contains another whole collection
606) The Enumeration Interface
607) The equals() method is used to check for element equality
608) The final constructor is the copy constructor
609) The HashSet class defines equality through its equals() method
610) The Length of an Array
611) The NavigableMap Interface
612) The NavigableSet Interface
613) The properties iterator iterates over a set of enumerated properties
614) The second two constructors are copy constructors
615) The SequenceInputStream Class
616) The third method subSet() provides the end points
617) The Vector class overrides the hashCode() method
618) The Vectors subList() method does not make a clone of the element references
619) Things you can do with Sets
620) This constructs an Iterator over each day in a date range defined by a focus date and range style
621) To add a single element
622) To copy all the key-value pairs from one Map into another
623) To create a read-only list, use the unmodifiableList() method of the Collections class
624) To enable automatically release of the value, the value must be wrapped in a WeakReference object
625) To fill part of array with object value, starting at array[fromIndex] up to and including array[toIndex-1]
626) To find out how many elements are in a set, use the size() method
627) To find out if an element is on the stack
628) To get a set of Map Entry elements back from a HashMap
629) To get rid of all key-value pairs
630) To get the number of dimensions
631) To get the set of all the values in the hash map
632) To perform some operation on all keys
633) To read a Properties file via an Applet
634) To reference the components of an array
635) Traverse through ArrayList in forward direction using Java ListIterator
636) Traverse through ArrayList in reverse direction using Java ListIterator
637) Treat an Iterator as an Iterable
638) TreeMap Class
639) TreeMapInteger, User defined class
640) TreeSet Class
641) TreeSet descendingSet
642) Turn an array of ints into a printable string
643) Understanding Weak References
644) Unlike a Hashtable, both the key and the value for a HashMap can be null
645) Unmodifiable Vector Adapter
646) Use a Comparator to create a PriorityQueue for messages
647) Use a comparator to sort accounts by last name
648) Use a custom comparator
649) Use a default property list
650) Use an Iterator to cycle through a collection in the forward direction
651) Use Arrays asList to convert array to generic list
652) Use Arrays asList to convert array to list
653) Use Arrays copyOf to copy array
654) Use Arrays equals to compare arrays
655) Use Arrays fill to set values of array
656) Use Arrays sort to sort an array
657) Use BitSet to mark holiday
658) Use Iterator to loop through ArrayList
659) Use Iterator to loop through the HashMap class
660) Use Iterator to loop through the map key set
661) Use iterators with a Hashtable
662) Use java util Arrays deepToString() to dump the multi-dimensional arrays
663) Use store() to save the properties
664) Use System arraycopy to duplicate array
665) Use the Stack class in Java
666) Use XML with Properties
667) Uses a generic Hashtable to store the names of bank depositors and their current balances
668) Using a for loop to iterate over all the elements and set the values
669) Using a LinkedList in multi-thread
670) Using a Utility Method in java util Arrays class to Initialize an Array
671) Using an Iterator
672) Using Arrays copyOf to copy an array
673) Using Comparable and Comparator
674) Using Enumeration to loop through Properties
675) Using Iterator to loop through Vector elements
676) Using list Iterator to loop through the vector
677) Using properties
678) Using reflection method to create new instance for a two dimensional Array
679) Using reflection method to create new instance for an Array
680) Using reflection to check array type and length
681) Using reflection to create, fill, and display an array
682) Using stack to reverse a string
683) Using the Collection-Based for Loop with an Array
684) Using the Collections synchronized methods
685) Using the elements() or the values() method to get the set of all the values in the hash table
686) Vector Immutability
687) Viewing Sub Maps
688) Viewing Subsets
689) WeakHashMap Class
690) WeakReference list uses java lang ref WeakReferences to store its contents
691) What you can do with a LinkedHashMap
692) When removing all the elements from a vector, the capacity does not change
693) Where do we get the enumeration from
694) Working with End Points
695) Working with Subsets
696) Wrap queue to synchronize the methods
697) Wrapper for arrays of ordered strings This verifies the arrays and supports efficient lookups
698) Writing Your own Comparator
699) Your own auto-growth Array